Affine completeness and wreath product decompositions of lattice ordered group

Wreath Product Decompositions for Triangular Matrix Semigroups

We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n× n upper triangular matrices over a given field k, in terms of aperiodic semigroups and affine groups over k. In the case that k is finite this decomposition is optimal, in the sense that the number of group terms is equal to the group c...

The wreath product principle for ordered semigroups

Straubing’s wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper. Applications to language theory extend standard results of the theory of varieties to positive varieties. They include a characterization of positive locally testable languages and syntactic descriptions ...

Semidirect Product Decompositions of Ordered Groupoids and Inverse Semigroups

Schauder Decompositions and Completeness

00 It x = S QnIf» m addition, the projections Pn = £ Q,are equicontinuous, then n = 1 « = 1 (£n)^°=1 is said to be an equi-Schauder decomposition of E. It is obvious that a Schauder basis is equivalent to a Schauder decomposition in which each subspace is one-dimensional, and that it is equi-Schauder if and only if the corresponding decomposition is equi-Schauder. For more information on Schaud...

Wreath Decompositions of Finite Permutation Groups

There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...